The Radius of Convergence Function for First Order Differential Equations

نویسندگان

  • Gilles CHRISTOL
  • GILLES CHRISTOL
چکیده

We present an algorithm computing, for any first order differential equation L over the affine line and any (Berkovich) point t of this affine line, the p-adic radius of convergence RL(t) of the solutions of L near t. We do explicit computations for the equation (0.1) L(f) def = xf ′ − π(px + ax)f = 0 (πp−1 = −p). where a lies in some valued extension of Qp. For a = −1 and t = 0, a solution of L near t is the Dwork exponential exp(πxp − πx). Among other important properties, it appears that the function RL(t) is entirely determined by its values on a finite subtree of the affine line. The radius of convergence function has been shown to be a basic tool when studying p-adic differential equations. Notably, for first order differential equations, it gives the index of the underlying differential operator acting on various spaces of functions. However explicit computations are far from easy except in the few “trivial” cases where the “small radius theorem” and the logarithmic concavity are sufficient to conclude. In this paper we give an algorithm to compute the radius of convergence function for any first order p-adic differential equation defined on the affine line. It rests crucially on the proposition 2.15 that gives a criterion to decide whether the radius of convergence of a product is the smallest radius of convergence of the factors. As a by-product, we prove a Baldassarri conjecture for first order differential equations without singularities in the affine line (corollary 3.3). Roughly speaking, this conjecture asserts that the radius of convergence function is entirely determined by its values on a finite sub-tree of the whole “quasi-polyhedron” structure made up by Berkovich points. Likely it should mean that the radius of convergence function is “definable” in the sense of [10]. As the computation becomes quickly very tedious, we achieve it only for the differential equation (0.1) which is the simplest but non-trivial case. This example as been already treated in [1] but here we present it following the general algorithm. 2000 Mathematics Subject Classification. Primary 12H25.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving fuzzy differential equations by using Picard method

In this paper,  The Picard method is proposed to solve the system of first-order fuzzy  differential equations  $(FDEs)$ with fuzzy initial conditions under generalized $H$-differentiability. Theexistence and uniqueness of the solution and convergence of theproposed method are proved in details. Finally, the method is illustrated by solving some examples.

متن کامل

Convergence of the multistage variational iteration method for solving a general system of ordinary differential equations

In this paper, the multistage variational iteration method is implemented to solve a general form of the system of first-order differential equations. The convergence of the proposed method is given. To illustrate the proposed method, it is applied to a model for HIV infection of CD4+ T cells and the numerical results are compared with those of a recently proposed method.

متن کامل

On solving ordinary differential equations of the first order by updating the Lagrange multiplier in variational iteration ‎method

In this paper, we have proposed a new iterative method for finding the solution of ordinary differential equations of the first order. In this method we have extended the idea of variational iteration method by changing the general Lagrange multiplier which is defined in the context of the variational iteration method.This causes the convergent rate of the method increased compared with the var...

متن کامل

Convergence, Consistency and Stability in Fuzzy Differential Equations

In this paper, we consider First-order fuzzy differential equations with initial value conditions. The convergence, consistency and stability of difference method for approximating the solution of fuzzy differential equations involving generalized H-differentiability, are studied. Then the local truncation error is defined and sufficient conditions for convergence, consistency and stability of ...

متن کامل

Approximated solution of First order Fuzzy Differential Equations under generalized differentiability

In this research, a numerical method by piecewise approximated method for solving fuzzy differential equations is introduced. In this method, the solution by piecewise fuzzy polynomial is present. The base of this method is using fuzzy Taylor expansion on initial value of fuzzy differential equations. The existence, uniqueness and convergence of the approximate solution are investigated. To sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011